Skeleton Redundancy Reduction Based on a Generalization of Convexity
نویسندگان
چکیده
We present a generalization of the concept of Convex Sets, based on the Morphological Closing operation, and study some of its properties. We also deene Extreme Points of such Generalized Convex Sets, which generalize the notion of Extreme Points of Convex Sets. Moreover, we apply the above notions to skeleton redundancy removal, and present an algorithm for obtaining an Error-Free Skeleton representation with reduced amount of redundant points, using morphological operations only.
منابع مشابه
Hermite-Hadamard Type Inequalities for MφA-Convex Functions
This article deals with the different classes of convexity and generalizations. Firstly, we reveal the new generalization of the definition of convexity that can reduce many order of convexity. We have showed features of algebra for this new convex function. Then after we have constituted Hermite-Hadamard type inequalities for this class of functions. Finally the identity has been revealed for ...
متن کاملMorphological reduction of skeleton redundancy
In this work we study morphological methods to reduce the amount of redundant points in the Skeleton representation of images. The advantage of removing redundant points using morphological operations only, lies in the computational eeciency of these operations, when implemented on parallel machines. We present a generic approach to obtain redundancy-reduced Skeletons, which yields morphologica...
متن کاملGeneralizing Jensen and Bregman divergences with comparative convexity and the statistical Bhattacharyya distances with comparable means
Comparative convexity is a generalization of convexity relying on abstract notions of means. We define the (skew) Jensen divergence and the Jensen diversity from the viewpoint of comparative convexity, and show how to obtain the generalized Bregman divergences as limit cases of skewed Jensen divergences. In particular, we report explicit formula of these generalized Bregman divergences when con...
متن کاملRedundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...
متن کاملA Convexity-based Generalization of Viterbi for Non-Deterministic Weighted Automata
We propose a novel approach for the maxstring problem in acyclic nondeterministic weighted FSA’s, which is based on a convexity-related notion of domination among intermediary results, and which can be seen as a generalization of the usual dynamic programming technique for finding the max-path (a.k.a. Viterbi approximation) in such automata.
متن کامل